Complexity of graphs generated by wheel graph and their asymptotic limits
نویسندگان
چکیده
منابع مشابه
Reliability Polynomials and their Asymptotic Limits for Families of Graphs
We present exact calculations of reliability polynomials R(G, p) for lattice stripsG of fixed widths Ly ≤ 4 and arbitrarily great length Lx with various boundary conditions. We introduce the notion of a reliability per vertex, r({G}, p) = lim|V |→∞R(G, p)1/|V | where |V | denotes the number of vertices in G and {G} denotes the formal limit lim|V |→∞G. We calculate this exactly for various famil...
متن کاملFlow Polynomials and their Asymptotic Limits for Lattice Strip Graphs
We present exact calculations of flow polynomials F (G, q) for lattice strips of various fixed widths Ly and arbitrarily great lengths Lx, with several different boundary conditions. Square, honeycomb, and triangular lattice strips are considered. We introduce the notion of flows per face fl in the infinite-length limit. We study the zeros of F (G, q) in the complex q plane and determine exactl...
متن کاملthe impact of attending efl classes on the level of depression of iranian female learners and their attributional complexity
می توان گفت واقعیت چند لایه ا ی کلاس های زبان انگلیسی بسیار حائز اهمیت است، زیرا عواطف و بینش های زبان آموزان تحت تاثیر قرار می گیرد. در پژوهش پیش رو، گفته می شود که دبیران با در پیش گرفتن رویکرد فرا-انسانگرایی ، قادرند در زندگی دانش آموزانشان نقش مهمی را ایفا سازند. بر اساس گفته ی ویلیامز و بردن (2000)، برای کرل راجرز، یکی از بنیان گذاران رویکرد انسانگرایی ، یادگیری بر مبنای تجربه، نوعی از یاد...
Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملLinear embeddings of graphs and graph limits
Many real-life networks can be modelled by stochastic processes with a spatial embedding. In such processes, the link probability decreases with distance. Using the theory of graph limits, we show how to recognize graph sequences produced by random graph processes with a linear embedding (a natural embedding into R). We define an operator Γ which applies to graph limits, which assumes the value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Egyptian Mathematical Society
سال: 2017
ISSN: 1110-256X
DOI: 10.1016/j.joems.2017.07.005